The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a__f(X) → a__if(mark(X), c, f(true))
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(f(X)) → a__f(mark(X))
mark(if(X1, X2, X3)) → a__if(mark(X1), mark(X2), X3)
mark(c) → c
mark(true) → true
mark(false) → false
a__f(X) → f(X)
a__if(X1, X2, X3) → if(X1, X2, X3)

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
a__if(false, X, if(false, X23713_0, X33714_0)) →⁺ a__if(false, mark(X23713_0), X33714_0)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [X33714_0 / if(false, X23713_0, X33714_0)].
The result substitution is [X / mark(X23713_0)].

(2) BOUNDS(n^1, INF)